Local Binary Pattern-Based Adaptive Differential Evolution for Multimodal Optimization Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A self-adaptive binary differential evolution algorithm for large scale binary optimization problems

This study proposes a new self-adaptive binary variant of a differential evolution algorithm, based on measure of dissimilarity and named SabDE. It uses an adaptive mechanism for selecting how new trial solutions are generated, and a chaotic process for adapting parameter values. SabDE is compared against a number of existing state of the art algorithms, on a set of benchmark problems including...

متن کامل

Binary Encoding Differential Evolution for Combinatorial Optimization Problems

Differential Evolution algorithm is a new competitive heuristic optimization algorithm in the continuous field. The operators in the original Differential Evolution are simple; however, these operators make it impossible to use the Differential Evolution in the binary space directly. Based on the analysis of problems led by the mutation operator of the original Differential Evolution in the bin...

متن کامل

Hybridizing Adaptive Biogeography-Based Optimization with Differential Evolution for Multi-Objective Optimization Problems

In order to improve the performance of optimization, we apply a hybridization of adaptive biogeography-based optimization (BBO) algorithm and differential evolution (DE) to multi-objective optimization problems (MOPs). A model of multi-objective evolutionary algorithms (MOEAs) is established, in which the habitat suitability index (HSI) is redefined, based on the Pareto dominance relation, and ...

متن کامل

Self-adaptive randomized and rank-based differential evolution for multimodal problems

Differential Evolution (DE) is a widely used successful evolutionary algorithm (EA) based on a population of individuals, which is especially well suited to solve problems that have non-linear, multimodal cost functions. However, for a given population, the set of possible new populations is finite and a true subset of the cost function domain. Furthermore, the update formula of DE does not use...

متن کامل

μJADEε: Micro adaptive differential evolution to solve constrained optimization problems

A highly competitive micro evolutionary algorithm to solve unconstrained optimization problems called μJADE (micro adaptive differential evolution), is adapted to deal with constrained search spaces. Two constraint-handling techniques (the feasibility rules and the ε-constrained method) are tested in μJADE and their performance is analyzed. The most competitive version is then compared against ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Cybernetics

سال: 2020

ISSN: 2168-2267,2168-2275

DOI: 10.1109/tcyb.2019.2927780